Fast Tensor Product Model Transformation for Higher Dimensional Problems
نویسندگان
چکیده
Tensor Product (TP) model transformation method was proposed recently as an automated gateway between a class of non-linear models and linear matrix inequality based control design. The core of the TP model transformation is the higher order singular value decomposition of a large sized tensor, which requires high computational power that is usually out of a regular computer capacity in case of higher dimensionality. This disadvantage restricts the applicability of the TP model transformation method to linear parameter varying state-space models with smaller number of state values. The aim of this paper is to propose a modification of the TP model transformation. The proposed version needs considerable less computational effort. The paper also presents a 6 dimensional problem to show that the execution of the original TP model transformation fails in higher dimension, but the modified transformation leads to solution.
منابع مشابه
WOVEN FRAMES IN TENSOR PRODUCT OF HILBERT SPACES
The tensor product is the fundemental ingredient for extending one-dimensional techniques of filtering and compression in signal preprocessing to higher dimensions. Woven frames play a crucial role in signal preprocessing and distributed data processing. Motivated by these facts, we have investigated the tensor product of woven frames and presented some of their properties. Besides...
متن کاملHigh Dimensional Finite Elements for Elliptic Problems with Multiple Scales and Stochastic Data
Multiple scale homogenization problems are reduced to single scale problems in higher dimension. It is shown that sparse tensor product Finite Element Methods (FEM) allow the numerical solution in complexity independent of the dimension and of the length scale. Problems with stochastic input data are reformulated as high dimensional deterministic problems for the statistical moments of the rand...
متن کاملOn Fast Computation of Gradients for CANDECOMP/PARAFAC Algorithms
Product between mode-n unfolding Y(n) of an N-D tensor Y and Khatri-Rao products of (N − 1) factor matrices A(m), m = 1, . . . , n − 1, n + 1, . . . , N exists in algorithms for CANDECOMP/PARAFAC (CP). If Y is an error tensor of a tensor approximation, this product is the gradient of a cost function with respect to factors, and has the largest workload in most CP algorithms. In this paper, a fa...
متن کاملFree Products of Higher Operad Algebras
One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product of 2-categories. In this paper we continue the developments of [3] and [2] by understanding the natural generalisations of Gray’s little brother, the funny tensor product of categories. In fact we exhibit for any higher categorical structure definable ...
متن کاملAlgebras of higher operads as enriched categories II
One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we continue the work of [7] to adapt the machinery of globular operads [4] to this task. The resulting theory includes the Gray tensor product of 2-categories and the Crans tensor product [12] of Gray categories. Moreover much of the pre...
متن کامل